Nilpotency and Limit Sets of Cellular Automata
نویسندگان
چکیده
A one-dimensional cellular automaton is a dynamical system which consisting in a juxtaposition of cells whose state changes over discrete time according to that of their neighbors. One of its simplest behaviors is nilpotency: all configurations of cells are mapped after a finite time into a given “null” configuration. Our main result is that nilpotency is equivalent to the condition that all configurations converge towards the null configuration for the Cantor topology, or, equivalently, that all cells of all configurations asymptotically reach a given state.
منابع مشابه
Computational Aspects of Cellular Automata on Countable Sofic Shifts
We investigate the computational properties of cellular automata on countable (equivalently, zero entropy) sofic shifts with an emphasis on nilpotency, periodicity, and asymptotic behavior. As a tool for proving decidability results, we prove the Starfleet Lemma, which is of independent interest. We present computational results including the decidability of nilpotency and periodicity, the unde...
متن کاملThe Nilpotency Problem of One-Dimensional Cellular Automata
The limit set of a celullar automaton consists of all the configurations of the automaton that can appear after arbitrarily long computations. It is known that the limit set is never empty--it contains at least one homogeneous configuration. A CA is called nilpotent if its limit set contains just one configuration. The present work proves that it is algorithmically undecidable whether a given o...
متن کاملOn Nilpotency and Asymptotic Nilpotency of Cellular Automata
One of the most interesting aspects in the theory of cellular automata is the study of different types of nilpotency, that is, different ways in which a cellular automaton can force a particular symbol (usually called 0) to appear frequently in all its spacetime diagrams. The simplest such notion, called simply ‘nilpotency’, is that the cellular automaton c maps every configuration to a uniform...
متن کاملA compact topology for sand automata
In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata are homeomorphic to cellular automata acting on a specific subshift. We show that the existing topological results for sand automata, including the Hedlund-lik...
متن کاملBI-OBJECTIVE OPTIMIZATION OF RESERVOIR OPERATION BY MULTI-STEP PARALLEL CELLULAR AUTOMATA
Parallel Cellular Automata (PCA) previously has been employed for optimizing bi-objective reservoir operation, where one release is used to meet both objectives. However, if a single release can only be used for one objective, meaning two separate sets of releases are needed, the method is not applicable anymore. In this paper, Multi-Step Parallel Cellular Automata (MSPCA) has been developed fo...
متن کامل